Priority Level Planning in Kriegspiel
نویسندگان
چکیده
Back in 1950, Shannon introduced planning in board games like Chess as a selective approach, where the main idea is to select specific branches of the game tree that satisfy certain conditions. He contrasted this approach with brute force Minimax-like methods, based on an exhaustive search of the game tree, that aims to select the best path inside a given search horizon. Historically, the brute force approach won hands down against planning in complex games such as Chess, as the strongest Chess programs nowadays all exploit brute force algorithms. However, planning is still interesting and even necessary in some game-playing domains, for instance based on incomplete information, where there is no way to evaluate precisely or even build the game tree. In this paper we describe a technique that produced positive results in Kriegspiel, a variant of Chess played as an incomplete information game. Our main result is the definition of an algorithm for combining MonteCarlo search with planning; we tested the algorithm on a strong Kriegspiel program based on MonteCarlo search, and obtained a clear improvement.
منابع مشابه
Moving in the Dark: Progress through Uncertainty in Kriegspiel
Kriegspiel is a wargame based on the rules of Chess. A player only knows the position of his own pieces, while his opponent’s pieces are “in the dark”, ie. they are invisible. A Kriegspiel player has to guess the state of the game and progress to checkmate being in the dark about the history of moves (but he can exploit the messages of a referee). Thus, computer playing of Kriegspiel is difficu...
متن کاملMonte Carlo Tree Search Techniques in the Game of Kriegspiel
Monte Carlo tree search has brought significant improvements to the level of computer players in games such as Go, but so far it has not been used very extensively in games of strongly imperfect information with a dynamic board and an emphasis on risk management and decision making under uncertainty. In this paper we explore its application to the game of Kriegspiel (invisible chess), providing...
متن کاملSearching over Metapositions in Kriegspiel
Kriegspiel is a Chess variant similar to wargames, in which players have to deal with uncertainty. Kriegspiel increases the difficulty typical of Chess by hiding from each player his opponent’s moves. Although it is a two person game it needs a referee, whose task consists in accepting the legal moves and rejecting the illegal ones, with respect to the real situation. Neither player knows the w...
متن کاملThe Dark Side of the Chessboard: an Assistant to Play Kriegspiel over the ICC
Kriegspiel is a variant of the game of Chess, introduced to make it more similar to wargames. It mainly differs from Chess in that players can only see their own pieces: they have to refer to a neutral agent – the umpire, or referee – to acquire additional, but always incomplete, information. This paper deals with the development of a visual interface to play Kriegspiel over the Internet Chess ...
متن کاملRepresenting Kriegspiel States with Metapositions
We describe a novel approach to incomplete information board games, which is based on the concept of metaposition as the merging of a very large set of possible game states into a single entity which contains at least every state in the current information set. This merging operation allows an artificial player to apply traditional perfect information game theory tools such as the Minimax theor...
متن کامل